On Randomness and Structure in Euclidean TSP Instances: A Study With Heuristic Methods

reflections on taught courses of the iranian ma program in english translation: a mixed-methods study

the issue of curriculum and syllabus evaluation and revision has been in center of attention right from when curriculum came into attention of educational institutions. thus everywhere in the world in educational institutions curricula and syllabi are evaluated and revised based on the goals, the needs, existing content, etc.. in iran any curriculum is designed in a committee of specialists and...

a study on rate making and required reserves determination in reinsurance market: a simulation

reinsurance is widely recognized as an important instrument in the capital management of an insurance company as well as its risk management tool. this thesis is intended to determine premium rates for different types of reinsurance policies. also, given the fact that the reinsurance coverage of every company depends upon its reserves, so different types of reserves and the method of their calc...

Euclidean TSP on two polygons

We give an O(nm+ nm +m logm) time and O(n +m) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles in the Euclidean plane, where n and m are the number of vertices of the two polygons.

Euclidean TSP

Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones

We present two approaches for the Euclidean TSP which compute high quality tours for large instances. Both approaches are based on pseudo backbones consisting of all common edges of good tours. The first approach starts with some pre-computed good tours. Using this approach we found record tours for seven VLSI instances. The second approach is window based and constructs from scratch very good ...